New Classes of Algebraic Interleavers
نویسندگان
چکیده
| In this paper we present classes of algebraic interleavers that permute a sequence of bits with nearly the same statistical distribution as a randomly chosen interleaver. When these interleavers are used in turbo-coding, they perform equal to or better than the average of a set of randomly chosen interleavers. They are based on a property of quadratic congruences over the ring of integers modulo powers of 2.
منابع مشابه
New deterministic interleaver designs for turbo codes
It is well known that an interleaver with random properties, quite often generated by pseudo-random algorithms, is one of the essential building blocks of turbo codes. However, randomly generated interleavers have two major drawbacks: lack of an adequate analysis that guarantees their performance and lack of a compact representation that leads to a simple implementation. In this paper we presen...
متن کاملMAGMA-JOINED-MAGMAS: A CLASS OF NEW ALGEBRAIC STRUCTURES
By left magma-$e$-magma, I mean a set containingthe fixed element $e$, and equipped by two binary operations "$cdot$", $odot$ with the property $eodot (xcdot y)=eodot(xodot y)$, namelyleft $e$-join law. So, $(X,cdot,e,odot)$ is a left magma-$e$-magmaif and only if $(X,cdot)$, $(X,odot)$ are magmas (groupoids), $ein X$ and the left $e$-join law holds.Right (and two-sided) magma-$e$-magmas are de...
متن کاملSurvey on Interleavers in IDMA System
In recent days, a new multiple access system called interleave division multiple access (IDMA) has provide greater attention to provide interleavers. A review of IDMA technology provided in communicating system based on different types of interleavers. This paper provides a study of IDMA technique with random interleaver, helical interleaver, tree based interleaver, prime interleaver, algebraic...
متن کاملImproved Method for Searching of Interleavers Using Garello's Method
In this paper an improved method for searching good interleavers from a certain set is proposed. The first few terms, corresponding to maximum distance of approximately 40 of the distance spectra, for turbo codes using these interleavers are determined by means of Garello’s method. The method is applied to find quadratic permutation polynomials (QPP) based interleavers. Compared to previous met...
متن کاملQuadratic Permutation Polynomial Interleavers for 3gpp Lte Turbo Codes
The contention-free property of interleavers is one of the key design requirements for the parallel decoding implementations of turbo codes in order to achieve high decoding throughput. Quadratic permutation polynomial (QPP) interleavers are maximum contention-free (MCF), i.e., every factor dividing the interleaver length becomes a possible degree of parallel decoding processing without any mem...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1998